Circulant Homogeneous Factorisations of Complete Digraphs Kpd with p an Odd Prime

نویسنده

  • Jing Xu
چکیده

Let F = (Kn,P) be a circulant homogeneous factorisation of index k, that means P is a partition of the arc set of the complete digraph Kn into k circulant factor digraphs such that there exists σ ∈ Sn permuting the factor circulants transitively amongst themselves. Suppose further such an element σ normalises the cyclic regular automorphism group of these circulant factor digraphs, we say F is normal. Let F = (Kpd ,P) be a circulant homogeneous factorisation of index k where pd, (d > 1) is an odd prime power. It is shown in this paper that either F is normal or F is a lexicographic product of two smaller circulant homogeneous factorisations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homogeneous factorisations of graphs and digraphs

A homogeneous factorisation (M,G,Γ,P) is a partition P of the arc set of a digraph Γ such that there exist vertex transitive groups M < G 6 Aut(Γ) such that M fixes each part of P setwise while G acts transitively on P. Homogeneous factorisations of complete graphs have previously been studied by the second and fourth authors, and are a generalisation of vertex-transitive self-complementary dig...

متن کامل

On factorisations of complete graphs into circulant graphs and the Oberwolfach Problem

Various results on factorisations of complete graphs into circulant graphs and on 2factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a complete solution to the Oberwolfach Problem is given for every 2-regular graph of order 2p where p ≡ 5 (mod 8) is prime.

متن کامل

A Family of Perfect Factorisations of Complete Bipartite Graphs

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n=p for an odd prime p. We construct a family of (p−1)/2 non-isomorphic perfect 1-factorisations of Kn, n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltonian if the permutation defined by any row relative to any other row is a single cy...

متن کامل

Finite prime distance graphs and 2-odd graphs

A graph G is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs are prime distance graphs if and only if the Tw...

متن کامل

Recognition by prime graph of the almost simple group PGL(2, 25)

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017